Faster Algorithms for Minimum Cycle Basis in Directed Graphs
نویسندگان
چکیده
منابع مشابه
Faster Algorithms for Minimum Cycle Basis in Directed Graphs
We consider the problem of computing a minimum cycle basis in a directed graph. The input to this problem is a directed graph G whose edges have nonnegative weights. A cycle in this graph is actually a cycle in the underlying undirected graph with edges traversable in both directions. A {−1, 0, 1} edge incidence vector is associated with each cycle: edges traversed by the cycle in the right dir...
متن کاملA Faster Deterministic Algorithm for Minimum Cycle Basis in Directed Graphs
We consider the problem of computing a minimum cycle basis in a directed graph. The input to this problem is a directed graph G whose edges have non-negative weights. A cycle in this graph is actually a cycle in the underlying undirected graph with edges traversable in both directions. A f 1;0;1g edge incidence vector is associated with each cycle: edges traversed by the cycle in the right dire...
متن کاملA Faster Algorithm for Minimum Cycle Basis of Graphs
In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The previous best result for this problem was an O(mn) algorithm, where ω is the best exponent of matrix multiplication. It is presently known that ω < 2.376. We obtain an O(mn +mn logn) algorithm for this problem. Our algorithm als...
متن کاملFaster Randomized and Deterministic Algorithms for Minimum Cycle Bases in Directed Graphs
We consider the problem of computing a minimum cycle basis in a directed graph. The input to this problem is a directed graph G whose edges have non-negative weights. A cycle in this graph is actually a cycle in the underlying undirected graph with edges traversable in both directions. A {−1,0,1} edge incidence vector is associated with each cycle: edges traversed by the cycle in the right dire...
متن کاملA Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
We consider the problem of computing a minimum cycle basis in a directed graph. The input to this problem is a directed graph G whose edges have non-negative weights. A cycle in this graph is actually a cycle in the underlying undirected graph with edges traversable in both directions. A {−1,0,1} edge incidence vector is associated with each cycle: edges traversed by the cycle in the right dire...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2008
ISSN: 0097-5397,1095-7111
DOI: 10.1137/060670730